Congruence lattices of free lattices in non-distributive varieties

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite distributive lattices are congruence lattices of almost- geometric lattices

A semimodular lattice L of finite length will be called an almost-geometric lattice, if the order J(L) of its nonzero join-irreducible elements is a cardinal sum of at most two-element chains. We prove that each finite distributive lattice is isomorphic to the lattice of congruences of a finite almost-geometric lattice.

متن کامل

Distributive Congruence Lattices of Congruence-permutable Algebras

We prove that every distributive algebraic lattice with at most א1 compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The א1 bound is optimal, as we find a distributive algebraic lattice D with א2 compact elements that is not isomorphic to the congruence lattice of any algebra with almost permutable congruences (hence n...

متن کامل

Non-matchable distributive lattices

Based on an acyclic orientation of the Z-transformation graph, a finite distributive lattice (FDL for short)M(G) is established on the set of all 1-factors of a plane (weakly) elementary bipartite graph G. For an FDL L, if there exists a plane bipartite graph G such that L is isomorphic to M(G), then L is called a matchable FDL. A natural question arises: Is every FDL a matchable FDL? In this p...

متن کامل

Congruence Lattices of Uniform Lattices

A lattice L is uniform, if for any congruence Θ of L, any two congruence classes A and B of Θ are of the same size, that is, |A| = |B| holds. A classical result of R. P. Dilworth represents a finite distributive lattice D as the congruence lattice of a finite lattice L. We show that this L can be constructed as a finite uniform lattice.

متن کامل

Free Distributive Completions of Partial Complete Lattices

The free distributive completion of a partial complete lattice is the complete lattice that it is freely generated by the partial complete latticèin the most distributive way'. This can be described as being a universal solution in the sense of universal algebra. Free distributive completions generalize the constructions of tensor products and of free completely distributive complete lattices o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Colloquium Mathematicum

سال: 1998

ISSN: 0010-1354,1730-6302

DOI: 10.4064/cm-76-2-269-278